Convex Powerdomains I

نویسنده

  • Karel Hrbacek
چکیده

A completion via Frink ideals is used to define a convex powerdomain of an arbitrary continuous lattice as a continuous lattice. The powerdomain operator is a functor in the category of continuous lattices and continuous inf-preserving maps and preserves projective limits and surjectivity of morphisms; hence one can solve domain equations in which it occurs. Analogous results hold for algebraic lattices and bounded complete algebraic cpo’s. 1’ 1987 Academic Press. Inc.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicate Transformers for Convex Powerdomains

We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...

متن کامل

Predicate transformers for extended probability and non-determinism

We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to conical powerdomains, the appropriate powerdomains for the combi...

متن کامل

Mixed powerdomains for probability and nondeterminism

We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equational theories; we establish functional representation theorems; and we show equivalencies between state transformers and appropriately healthy predicate transformers. The extended nonnegative reals serve as ‘truth-values’. As usual with ...

متن کامل

Semantic Domains for Combining Probability and Non-Determinism

We present domain-theoretic models that support both probabilistic and nondeterministic choice. In [36], Morgan and McIver developed an ad hoc semantics for a simple imperative language with both probabilistic and nondeterministic choice operators over a discrete state space, using domaintheoretic tools. We present a model also using domain theory in the sense of D.S. Scott (see e.g. [15]), but...

متن کامل

Generalized ultrametric spaces : completion , topology , and powerdomains via the Yoneda embedding

Generalized ultrametric spaces are a common generalization of preorders and ordinary ultrametric spaces (Lawvere 1973, Rutten 1995). Combining Lawvere's (1973) enriched-categorical and Smyth' (1987, 1991) topological view on generalized (ultra)metric spaces, it is shown how to construct 1. completion, 2. topology, and 3. powerdomains for generalized ultrametric spaces. Restricted to the special...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 1987